randomizing algorithmの例文

• A simpler randomized algorithm with linear expected time is also known.
• In some cases such randomized algorithms outperform the best deterministic methods.
• Note that this distinction is only meaningful for randomized algorithms.
• In some cases, such randomized algorithms outperform the best deterministic methods.
• Algorithms that use random bits are called randomized algorithms.
• A Monte Carlo algorithm is a randomized algorithm which is likely to be correct.
• The fastest randomized algorithms employ the multi-trials technique by Schneider et al.
• Alternatively, a randomized algorithm can be used.
• Randomized algorithms are algorithms that employ a degree of randomness as part of their logic.
• In some cases, such randomized algorithms are able to outperform the best deterministic methods.
• In the setting with many satisfying assignments the randomized algorithm by Sch鰊ing has a better bound.
• Versions of the problem for randomized algorithms and quantum algorithms have also been formulated and studied.
• The first two will be randomized algorithms while the last one will be a deterministic algorithm.
• In many cases, the space requirements for an algorithm can be drastically cut by using a randomized algorithm.
• The words of Goethe proved prophetic, when in the 20th century randomized algorithms were discovered as powerful tools.
• The only case in which it can be improved is with randomized algorithms guaranteeing partial proportionality with disconnected pieces.
• In 2011, a randomized algorithm with competitive bound ?( log 2 k log 3 n ) was found.
• Yao's principle is a game-theoretic technique for proving computational complexity of randomized algorithms, especially online algorithms.
• Several different methods are known for computing the Theil Sen estimator exactly in time, either deterministically or using randomized algorithms.
• The current state-of-the-art randomized algorithms are faster for sufficiently large maximum degree ? than deterministic algorithms.